GENERALIZED EULER‐KNOPP METHOD AND CONVERGENCE ACCELERATION
نویسندگان
چکیده
منابع مشابه
Modified frame algorithm and its convergence acceleration by Chebyshev method
The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...
متن کاملAn Analytic Method for Convergence Acceleration of Certain Hypergeometric Series
A method is presented for convergence acceleration of the generalized hypergeometric series 3F2 with the argument ±1 , using analytic properties of their terms. Iterated transformation of the series is performed analytically, which results in obtaining new fast converging expansions for some special functions and mathematical constants.
متن کاملSemi-explicit Parareal method based on convergence acceleration technique
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We report a derivation of the Parareal method that uses a convergence acceleration technique to improve the accuracy of the solution. Our approach uses firstly...
متن کاملNew and Generalized Convergence Conditions for the Newton-kantorovich Method
We present new semilocal convergence theorems for Newton methods in a Banach space. Using earlier general conditions we find more precise error estimates on the distances involved using the majorant principle. Moreover we provide a better information on the location of the solution. In the special case of Newton’s method under Lipschitz conditions we show that the famous Newton–Kantorovich hypo...
متن کاملGeneralized Aitken-like Acceleration of the Schwarz Method
(and Introduction) In this paper, we present a family of domain decomposition based on Aitken like acceleration of the Schwarz method seen as an iterative procedure with linear rate of convergence. This paper is a generalization of the method first introduced in Garbey and Tromeur-Dervout [2001] that was restricted to Cartesian grids. The general idea is to construct an approximation of the eig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Modelling and Analysis
سال: 2006
ISSN: 1392-6292,1648-3510
DOI: 10.3846/13926292.2006.9637304